A secure approach for embedding message text on an elliptic curve defined over prime fields, and building 'EC-RSA-ELGamal' Cryptographic System
نویسندگان
چکیده
This paper presents a new probabilistic approach to embedding message text on an elliptic curve, by using the concept of the RSA Algorithm and its security, and such approach allows us discovering the message from the point, only according to the security of the RSA Algorithm. By mixing between the concept of this approach and the concept of EC-ELGamal Cryptographic System, we have built a cryptographic System and we named it 'EC-RSA-ELGamal'
منابع مشابه
Time stamp based ECC encryption and decryption
Elliptic Curve Cryptography (ECC) provides a secure means of exchanging keys among communicating hosts using the diffie hellman key exchange algorithm. Encryption and decryption of texts and messages have also been attempted. In the paper on Knapsack over ECC algorithm, the authors presented the implementation of ECC by first transforming the message into an affine point on the EC, and then app...
متن کاملEncoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves
At PKC 2006, Chevallier-Mames, Paillier, and Pointcheval proposed a very elegant technique over cyclic subgroups of Fp eliminating the need to encode the message as a group element in the ElGamal encryption scheme. Unfortunately, it is unclear how to adapt their scheme over elliptic curves. In a previous attempt, Virat suggested an adaptation of ElGamal to elliptic curves over the ring of dual ...
متن کاملNonce Based Elliptic Curve Cryptosystem for Text and Image Applications
With the explosion of networks and the huge amount of data transmitted along, securing data content is becoming more and more important. Data encryption is widely used to ensure security in open networks such as the Internet. With the fast development of cryptography research and computer technology, the capabilities of cryptosystems such as of RSA and Diffie-Hellman are inadequate due to the r...
متن کاملA coprocessor for secure and high speed modular arithmetic
We present a coprocessor design for fast arithmetic over large numbers of cryptographic sizes. Our design provides a efficient way to prevent side channel analysis as well as fault analysis targeting modular arithmetic with large prime or composite numbers. These two countermeasure are then suitable both for Elliptic Curve Cryptography over prime fields or RSA using CRT or not. To do so, we use...
متن کاملElliptic Curve Digital Signatures and Accessories
Digital signatures have been used in Internet applications to provide data authentication and non-repudiation services. Digital signatures will keep on playing an important role in future Internet applications. There are two most well-known public-key cryptosystems, the RSA scheme and the ElGamal scheme, which can provide both digital signature and data encryption. More recently, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1707.04892 شماره
صفحات -
تاریخ انتشار 2017